Search results for "factorization [cross section]"
showing 10 items of 20 documents
A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY
2013
Motivated by the extension of the critical factorization theorem to infinite words, we study the (local) periodicity function, i.e. the function that, for any position in a word, gives the size of the shortest square centered in that position. We prove that this function characterizes any binary word up to exchange of letters. We then introduce a new complexity function for words (the periodicity complexity) that, for any position in the word, gives the average value of the periodicity function up to that position. The new complexity function is independent from the other commonly used complexity measures as, for instance, the factor complexity. Indeed, whereas any infinite word with bound…
Discrete and Conservative Factorizations in Fib(B)
2021
AbstractWe focus on the transfer of some known orthogonal factorization systems from$$\mathsf {Cat}$$Catto the 2-category$${\mathsf {Fib}}(B)$$Fib(B)of fibrations over a fixed base categoryB: the internal version of thecomprehensive factorization, and the factorization systems given by (sequence of coidentifiers, discrete morphism) and (sequence of coinverters, conservative morphism) respectively. For the class of fibrewise opfibrations in$${\mathsf {Fib}}(B)$$Fib(B), the construction of the latter two simplify to a single coidentifier (respectively coinverter) followed by an internal discrete opfibration (resp. fibrewise opfibration in groupoids). We show how these results follow from thei…
Characteristic Sturmian words are extremal for the Critical Factorization Theorem
2012
We prove that characteristic Sturmian words are extremal for the Critical Factorization Theorem (CFT) in the following sense. If p x ( n ) denotes the local period of an infinite word x at point n , we prove that x is a characteristic Sturmian word if and only if p x ( n ) is smaller than or equal to n + 1 for all n ≥ 1 and it is equal to n + 1 for infinitely many integers n . This result is extremal with respect to the \{CFT\} since a consequence of the \{CFT\} is that, for any infinite recurrent word x, either the function p x is bounded, and in such a case x is periodic, or p x ( n ) ≥ n + 1 for infinitely many integers n . As a byproduct of the techniques used in the paper we extend a r…
Factorization of absolutely continuous polynomials
2013
In this paper we study the ideal of dominated (p,s)-continuous polynomials, that extend the nowadays well known ideal of p-dominated polynomials to the more general setting of the interpolated ideals of polynomials. We give the polynomial version of Pietsch s factorization Theorem for this new ideal. Our factorization theorem requires new techniques inspired in the theory of Banach lattices.
Domination spaces and factorization of linear and multilinear summing operators
2015
[EN] It is well known that not every summability property for multilinear operators leads to a factorization theorem. In this paper we undertake a detailed study of factorization schemes for summing linear and nonlinear operators. Our aim is to integrate under the same theory a wide family of classes of mappings for which a Pietsch type factorization theorem holds. Our construction includes the cases of absolutely p-summing linear operators, (p, sigma)-absolutely continuous linear operators, factorable strongly p-summing multilinear operators, (p(1), ... , p(n))-dominated multilinear operators and dominated (p(1), ... , p(n); sigma)-continuous multilinear operators.
Pietsch's factorization theorem for dominated polynomials
2007
Abstract We prove that, like in the linear case, there is a canonical prototype of a p -dominated homogeneous polynomial through which every p -dominated polynomial between Banach spaces factors.
Multialternating graded polynomials and growth of polynomial identities
2012
Let G be a finite group and A a finite dimensional G-graded algebra over a field of characteristic zero. When A is simple as a G-graded algebra, by mean of Regev central polynomials we construct multialternating graded polynomials of arbitrarily large degree non vanishing on A. As a consequence we compute the exponential rate of growth of the sequence of graded codimensions of an arbitrary G-graded algebra satisfying an ordinary polynomial identity. In particular we show it is an integer. The result was proviously known in case G is abelian.
A Periodicity Theorem on Words and Applications
1995
We prove a periodicity theorem on words that has strong analogies with the Critical Factorization theorem and we show three applications of it.
Factorization at Subleading Power, Sudakov Resummation and Endpoint Divergences in Soft-Collinear Effective Theory
2020
Starting from the first renormalized factorization theorem for a process described at subleading power in soft-collinear effective theory, we discuss the resummation of Sudakov logarithms for such processes in renormalization-group improved perturbation theory. Endpoint divergences in convolution integrals, which arise generically beyond leading power, are regularized and removed by systematically rearranging the factorization formula. We study in detail the example of the $b$-quark induced $h\to\gamma\gamma$ decay of the Higgs boson, for which we resum large logarithms of the ratio $M_h/m_b$ at next-to-leading logarithmic order. We also briefly discuss the related $gg\to h$ amplitude.
A multidimensional critical factorization theorem
2005
AbstractThe Critical Factorization Theorem is one of the principal results in combinatorics on words. It relates local periodicities of a word to its global periodicity. In this paper we give a multidimensional extension of it. More precisely, we give a new proof of the Critical Factorization Theorem, but in a weak form, where the weakness is due to the fact that we loose the tightness of the local repetition order. In exchange, we gain the possibility of extending our proof to the multidimensional case. Indeed, this new proof makes use of the Theorem of Fine and Wilf, that has several classical generalizations to the multidimensional case.